SUDOKU Colorings of the Hexagonal Bipyramid Fractal
نویسنده
چکیده
The hexagonal bipyramid fractal is a fractal in three dimensional space, which has fractal dimension two and which has six square projections. We consider its 2nd level approximation model, which is composed of 81 hexagonal bipyramid pieces. When this object is looked at from each of the 12 directions with square appearances, the pieces form a 9× 9 grid of squares which is just the grid of the SUDOKU puzzle. In this paper, we consider colorings of the 81 pieces with 9 colors so that it has a SUDOKU solution pattern in each of the 12 appearances, that is, each row, each column, and each of the nine 3×3 blocks contains all the 9 colors in each of the 12 appearances. We show that there are 140 solutions modulo change of colors, and, if we identify isomorphic ones, we have 30 solutions. We also show that SUDOKU coloring solutions exist for every level 2n approximation models (n ≥ 1).
منابع مشابه
Sudoku Colorings of a 16-Cell Pre-fractal
We study coloring problems of the third-level approximation of a 16-cell fractal. This four-dimensional object is projected to a cube in eight different ways, after which it forms an 8× 8× 8 grid of cubes. On each such grid, we can consider two Sudoku-like colorings. Our question is whether it is possible to assign colors to the 8 pieces of this pre-fractal object in such a manner that all of i...
متن کاملA compact stacked Quasi-fractal microstrip antenna for RFID applications
In this paper, we propose a new compact quasi-fractal shaped microstrip antenna that consists of a hexagonal patch as the main radiator and a complementary stacked patch as the parasitic element. The overall surface of the proposed quasi-fractal patch is about 55% lower than the conventional hexagonal patch. Using of stacked technique, the gain reduction of compression technique is almost compe...
متن کاملUpper bounds on sets of orthogonal colorings of graphs
We generalize the notion of orthogonal latin squares to colorings of simple graphs. Two n-colorings of a graph are said to be orthogonal if whenever two vertices share a color in one coloring they have distinct colors in the other coloring. We show that the usual bounds on the maximum size of a certain set of orthogonal latin structures such as latin squares, row latin squares, equi-n squares, ...
متن کاملDesign and Implementation of a Compact Super-Wideband Printed Antipodal Antenna Using Fractal Elements
A compact printed fractal antipodal bow-tie antenna is designed and implemented to simultaneously cover the operations in the C, X, and Ku-bands. It is demonstrated that by addition of small fractal elements at the sides of hexagonal arms of the bow-tie, a wide operating frequency range of 3.3 to 19.1 GHz can be covered while antenna size is only 30×34×1.2 mm3. In order to match the antenna to ...
متن کاملImaginary Cubes and Their Puzzles
Imaginary cubes are three dimensional objects which have square silhouette projections in three orthogonal ways just as a cube has. In this paper, we study imaginary cubes and present assembly puzzles based on them. We show that there are 16 equivalence classes of minimal convex imaginary cubes, among whose representatives are a hexagonal bipyramid imaginary cube and a triangular antiprism imag...
متن کامل